time and space complexity

However, the time and space complexity of support vector machine is a bottleneck in processing large-scale data.

但由于支持向量机方法复杂，导致在处理大规模数据集时存在相关问题。

Experiments show that the new algorithm reduces the time and space complexity, especially in the sparse dataset environment.

实验表明新的频繁闭合项集挖掘算法在一定程度上降低了时空复杂度，尤其在稀疏型数据集环境下，该算法所体现的优越性更加突出。

Fast composite-event probability algorithm with both linear time and space complexity is proposed.

提出了一种可应用于电力系统充裕度分析的快速组合事件概率求取方法。

With the increase of formal contexts, the time and space complexity of building concept lattice will sharply increase.

随着处理的形式背景的增大，构造概念格的时空复杂度也会随着急剧增大。

Solving the first k out of a short path algorithm, and other short-path k-solving algorithm, this algorithm has better time and space complexity.

出了一个求解第k短路径的算法，和其它求解第k短路径的算法相比，本算法具有较好的时间和空间复杂度。

The experimental result shows that the algorithm can reduce time and space complexity effectively on the basis of ensuring the biology sensitivity.

对3种算法对比实验表明，该算法在保证其生物敏感性的基础上，有效地降低了时间和空间复杂度。

The computational complexity on time and space of the proposed algorithm are both O ( n), which are both smaller than those of the classical algorithms.

该算法能快速有效地求解可分离连续凸二次背包问题的最优解，算法的时间复杂度和空间复杂度都是O（n），都比经典算法节约很多。

In the system design, we adopt microcode control approach and pipeline processing, so as to make the time and space complexity low.

在系统设计中，采用了微程序控制方法和流水线技术。

We prove the finite convergence of CLAR-LASSO and analyze its time and space complexity.

我们证明了CLAR-LASSO的有限收敛性，并分析了它的时间复杂度和空间复杂度。

The main results are as follows: 1. Base upon the existence of species diversity, structure complexity and space-time stability of forestry ecosystem, the concept and basic theoretic framework of "Sustainable Pest Management in Forest" were advanced.

基于森林生态系统的物种多样性、结构复杂性和时空稳定性，提出了森林有害生物持续控制的概念和基本理论框架。

Access control is the key problem in a hierarchy system. An access control scheme based on Lagrange's interpolation polynomial is proposed, and the property is analyzed from the view of time and space complexity.

本文基于Lagrange插值多项式，提出了等级系统中的一个访问控制方案，并从空间复杂度和时间复杂度角度分析了其性能。

It reduces time and space complexity by introducing data dividing technique, using High Performance computer system such as group system.

这种算法采用数据划分技术，利用高性能计算机系统，如集群式系统，有效地提高了双序列比对的时间空间效率。

The time and the space complexity of the algorithm are lowest.

性能分析表明该算法具有最小的时间复杂度，并且在基于半边Z结构的情况下具有最小的额外空间复杂度。

It is shown that our algorithm can be realized with lower time and space complexity and adjustable object detection error rate with comparison to other background subtraction algorithms.

与已有算法相比，该算法具有较低的时间、空间复杂度和可调的误检率。

Additionally the algorithm has the optimal time and space complexity.

此外，这种算法具有最优的时间和空间复杂性。

The algorithm we use has low time and space complexity, and has high parallelism.

所用算法具有较低的时间和空间复杂性，并有高度的并行性。

The time and space complexity for generating one sentence is O ( r+ n), where n is the restricted length or depth of sentences and r is the number of productions in given CFG.

其生成一条句子的时间和空间复杂度是O（r+n），其中n是生成句子的长度或深度限制，r是给定上下文无关文法中产生式的数目。

How to estimate the time and space complexity is described in order to optimize the performance of the software.

如何估算时间复杂度和空间复杂度，来优化程序的性能；

But standard SVM is subject to its constraints of time and space complexity, and cannot deal with large-scale network anomaly detection problems.

但是，标准支持向量机（SVM）算法受其时间和空间复杂度约束，无法有效地处理大规模数据集。

In essence, TIC achieves the best tradeoff between time and space complexity by balancing workload of computation and memory access, which ensures that the TIC algorithm has good scalability on multi-core architectures.

从本质上说，TIC通过平衡算法的计算负载和访存负载，在时间和空间复杂度上取得了最佳的折衷，从而保证了算法在多核结构上具有良好的可扩放性。

Its description, time and space complexity and contrasting experiment data are presented.

全文给出了该算法的描述，时间/空间复杂度分析和实验比较数据。

The time and space complexity of this algorithm was also analyzed and some possible work of conflict detection among rules was pointed out.

最后，分析其时间和空间复杂度，并指出规则冲突检测中一些可能的工作。

The results show that our approach can build well performance model, have better accuracy and coverage, and have low time and space complexity.

结果表明，本算法能很好的从搜索日志中建立推荐模型，在测试集中具有更好的准确度和覆盖率，并具有较低的时间和空间复杂度。

This paper also shows the time and space complexity of the auto waves approach. Finally, experiments on solving TSP are presented.

本文还对所提出方法的时间和空间的复杂度给出了说明，最后大量的实验算例证明了本文方法的正确性和有效性。

But it is large in time and space complexity, it is restricted in practical.

而动态规划由于其时间和空间复杂度的庞大，在实际使用中受到了限制。

However, the number of EPs in dense, dimensional datasets is huge which increases the time and space complexity.

然而，对于稠密数据集和高维数据集来说，EPs的数量巨大，因而增加了算法的时空复杂度。

This thesis analyzes the time and space complexity for algorithm.

本文分析了查询算法的时间复杂度和空间复杂度。

Performance analyses are developed aim at time and space complexity.

针对探测时间和空间复杂度等指标对算法进行了性能分析。